#pragma once
//
//////////////////////////////////////////////////////////////////////////////////////
///**************************************************************
//	LZSS.C -- A Data Compression Program
//	(tab = 4 spaces)
//***************************************************************
//	4/6/1989 Haruhiko Okumura
//	Use, distribute, and modify this program freely.
//	Please send me your improved versions.
//		PC-VAN		SCIENCE
//		NIFTY-Serve	PAF01022
//		CompuServe	74050,1022
//**************************************************************/
//#include <stdio.h>
//#include <stdlib.h>
//#include <string.h>
//#include <ctype.h>
//
//
//#define N		 4096	/* size of ring buffer */
//#define F		   18	/* upper limit for match_length */
//#define THRESHOLD	2   /* encode string into position and length
//						   if match_length is greater than this */
//#define NIL			N	/* index for root of binary search trees */
//
//
//class lzss1
//{
//	unsigned int textsize;		/* text size counter */
//	unsigned int codesize;		/* code size counter */
//	unsigned int printcount;	/* counter for reporting progress every 1K bytes */
//
//	unsigned char text_buf[N + F - 1];	/* ring buffer of size N,with extra F-1 bytes to facilitate string comparison */
//	int			  match_position, match_length;  /* of longest match.  These areset by the InsertNode() procedure. */
//	int 		  lson[N + 1], rson[N + 257], dad[N + 1];  /* left & right children &	parents -- These constitute binary search trees. */
//
//	lzss1();
//	void InitTree(void);
//	void InsertNode(int r);
//	void DeleteNode(int p);  /* deletes node p from tree */
//	void Encode(void);
//	void Decode(void);	/* Just the reverse of Encode(). */
//};
//
//
